高功率水介质开关加载脉冲电压波头的数值分析

文中对02号实验装置——高功率脉冲水介质开关上加载的脉冲电压的波头作了数值分析,理论上讨论了各参数对水开关工作性能的影响,得出了C_M/C对水击穿特性影响很大的重要结论,从而给高功率亚微秒水开关的设计提供了理论依据。本装置的大量实验数据验证了计算的正确性。     

典型 ATM 交换机缓冲系统在类 C/S 业务模式下的队列长度比较

许多应用场合中的通信业务可以用类用户一服务器（C／S）业劳模式来表达,因此有必要研究这种业务下的ATM交换机缓冲存储器策略;本文以计算机仿真的手段评估了四种典型缓冲结构的队列长度概率分布情况,进而比较了类C／S业劳模式下ATM交换机几种典型缓冲系统的性能。     

Prolog 编译器中暂时变量分配方法研究

文中研究对prolog 编译器的暂时变量的分配,介绍了回溯分配法,着重介绍了一种高效的无回溯分配法的实现原理及其优点。     

能量均衡的围捕任务分配方法

随着水下机器人反围捕策略研究的不断深入，水下机器人围捕变得越来越困难。为此构建一种多层环状伏击围捕模型并设计了基于围捕任务的任务分配方法，使得水下机器人能够充分利用自身的特点更好地完成任务。同时，考虑在围捕过程中随时间推移，系统内能量会出现消耗不均的现象，据此提出一种能量均衡方法平衡系统能量的消耗。实验证明所提出的基于多层环状围捕模型的能量均衡策略任务分配方法能有效提高围捕成功率，延长系统寿命。     

DSOCC：面向区分服务的拥塞控制

在区分服务(DiffServ)中使用确保转发(AssuredForwarding)进行TCP传输,存在带宽分配不公平问题。已有的工作没有综合考虑订购带宽、报文大小、RTT(RoundTripTime)对TCP性能的影响。为了解决TCP在DiffServ中的公平性问题,提出了面向区分服务的拥塞控制算法DSOCC(DiffServ OrientedCongestionControl)。通过模拟验证了该算法的有效性。     

A critical look at the U.S. deceased‐donor organ procurement and utilization system

The U.S. system for procuring and utilizing deceased‐donor organs for transplantation has been studied and written about in many articles. The purpose of this paper is to examine the interactions between the elements that comprise this system, and point out improvement opportunities that may be affected through operations research/management techniques. The authors demonstrate the need for developing data‐driven and analytic tools. In fact, data is used to generate hypotheses and support claims throughout the paper. The paper also points out the need to fully leverage data that is available to researchers, and to seek data that is currently not deposited in a centralized archive.     

双站无源定位最佳配置分析

为了提高双站无源定位精度,在全局坐标系下分析了双站纯方位定位系统的最佳配置形式。首先研究了最小GDOP(Geometric Dilution of Precision)意义下的方位角约束关系及最优夹角,得到双站的最佳配置形式是目标与两传感器间呈一确定夹角的等腰三角形;在此基础上,讨论了夹角对GDOP的影响进而提出有效定位区域的概念,指出只有当目标位于该区域内时双站才能获得较好的定位精度。仿真结果验证了上述关于最佳配置形式及有效定位区域的分析,指出该结论可以应用到基于传感器管理的多站无源定位算法中。     

基于效费比的武器目标分配

有效武器目标分配(WTA)是防空阵地的核心。分析了目标毁伤收益、武器损伤关键战术指标因素,提出基于效费比的WTA评价标准,建立了针对多目标的WTA模型,并研究了用遗传算法求解模型的方法。该遗传算法通过设计一种武器目标分配的染色体编码,利用最优保存策略选择运算、均匀交叉运算、非均匀变异运算来求解。仿真结果验证了模型的合理性和算法的有效性。     

Cost allocation of capacity investment games

Consider a manufacturer serving a set of retail stores each of which faces deterministic demands in a finite planning horizon. At the beginning of the planning horizon, the production capacity of the manufacturer is built, followed by production, outsourcing to third party manufacturers if necessary and distribution to the retail stores. Because the retail stores are usually managed by different managers who act as independent profit centers, it is desirable that the total cost is divided among the retail stores so that their incentives can be appropriately captured and thus efficient operations can be achieved. Under various conditions, we prove that there is a fair allocation of costs among the retail stores in the sense that no subset of retail stores subsidizes others, or equivalently, the resulting capacity investment game has a nonempty core, that is, the capacity investment game is a balanced game. In addition, our proof provides a mechanism to compute a fair cost allocation. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 512–523, 2013     

Inspection games with local and global allocation bounds

This article discusses a two‐player noncooperative nonzero‐sum inspection game. There are multiple sites that are subject to potential inspection by the first player (an inspector). The second player (potentially a violator) has to choose a vector of violation probabilities over the sites, so that the sum of these probabilities do not exceed one. An efficient method is introduced to compute all Nash equilibria parametrically in the amount of resource that is available to the inspector. Sensitivity analysis reveals nonmonotonicity of the equilibrium utility of the inspector, considered as a function of the amount of resource that is available to it; a phenomenon which is a variant of the well‐known Braess paradox. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013